150 research outputs found

    The Impact of Forward Error Correction on Wireless Sensor Network Performance

    Full text link
    In networks there are basically two methods to tackle the problem of erroneous packets: Automatic Repeat Requests (ARQ) and Forward Error Correction (FEC). While ARQ means packet retransmissions, FEC uses additional bits to detect and correct distorted data. However, extensive field test of our sensor nodes have shown that FEC can take effect only as long as both sender and receiver are bit-wise synchronized. Otherwise, all following bits are misinterpreted which results in an uncorrectable number of errors. We will thus introduce a new resync scheme which is particularly tailored for many sensor network platforms using UARTs in conjunction with radio transmission. We can show that only using an appropriate resync mechanism exploits the full potential of FEC

    An Energy-Efficient Forwarding Scheme for Wireless Sensor Networks

    Get PDF
    Energy-efficient forwarding becomes important if resources and battery lifetime are limited such as in Wireless Sensor Networks. Although widely used, simple hop-based forwarding along a path from one node towards a sink can be very inefficient in terms of delivery rate as well as energy efficiency, especially in lossy environments. We will show that just minimizing the expected number of transmissions within the network is not always the most efficient forwarding strategy. Using a realistic link loss model, we derive two new forwarding schemes named Single-Link and Multi-Link Energy-Efficient Forwarding that trade off delivery rate and energy costs best by maximizing energy efficiency. Multi-Link Forwarding further benefits from addressing multiple receivers during packet forwarding, instead of a single one. By mathematical analyses, extensive simulations, and experimental experiments we contrast the performance of our approaches against a comprehensive framework of different forwarding strategies

    TECA : A Topology and Energy Control Algorithm for Sensor Networks

    Full text link
    A main challenge in the field of sensor networks is energy efficiency to prolong the sensor's operational lifetime. Due to low-cost hardware, nodes' placement or hardware design, recharging might be impossible. Since most energy is spent for radio communication, many approaches exist that put sensor nodes into sleep mode with the communication radio turned off. In this paper, we propose a new Topology and Energy Control Algorithm called TECA. We will show the performance of TECA by means of extensive simulations compared to two other approaches. In terms of operational lifetime, packet delivery and network connectivity, TECA shows promising results. Unlike many other simulations, we use an appropriate link loss model that was verified in reality. By measuring packet delivery rates, TECA is able to adapt to different environments while still maintaining network connectivity

    The Impact of Resync on Wireless Sensor Network Performance

    Full text link
    Many of todays sensor nodes exhibit special transmission errors. These errors are due to some common hardware components being used, particularly the so-called UART (serial communication) circuits that interconnects radio transceivers and the CPUs. UARTs generate start-, data- and stop-bits. As long as the state machine at the sender and the receiver is synchronized, even single bit errors can often be corrected by Forward Error Correction (FEC). However, once one or several bits are missed, the state machine at the receiver side will get out of sync so that data bits are misinterpreted as start- or stop-bits and vice versa, rendering the entire remaining communication useless. In this paper, we will devise a periodic resync scheme that enables the receiver to catch up on a data stream even in case of skipped bits. In noisy environments as well as for weak senders, we can improve the overall data throughput significantly

    Algorithms for Energy Efficiency in Wireless Sensor Networks

    Get PDF
    The recent advances in microsensor and semiconductor technology have opened a new field within computer science: the networking of small-sized sensors which are capable of sensing, processing, and communicating. Such wireless sensor networks offer new applications in the areas of habitat and environment monitoring, disaster control and operation, military and intelligence control, object tracking, video surveillance, traffic control, as well as in health care and home automation. It is likely that the deployed sensors will be battery-powered, which will limit the energy capacity significantly. Thus, energy efficiency becomes one of the main challenges that need to be taken into account, and the design of energy-efficient algorithms is a major contribution of this thesis. As the wireless communication in the network is one of the main energy consumers, we first consider in detail the characteristics of wireless communication. By using the embedded sensor board (ESB) platform recently developed by the Free University of Berlin, we analyze the means of forward error correction and propose an appropriate resync mechanism, which improves the communication between two ESB nodes substantially. Afterwards, we focus on the forwarding of data packets through the network. We present the algorithms energy-efficient forwarding (EEF), lifetime-efficient forwarding (LEF), and energy-efficient aggregation forwarding (EEAF). While EEF is designed to maximize the number of data bytes delivered per energy unit, LEF additionally takes into account the residual energy of forwarding nodes. In so doing, LEF further prolongs the lifetime of the network. Energy savings due to data aggregation and in-network processing are exploited by EEAF. Besides single-link forwarding, in which data packets are sent to only one forwarding node, we also study the impact of multi-link forwarding, which exploits the broadcast characteristics of the wireless medium by sending packets to several (potential) forwarding nodes. By actively selecting a forwarder among all nodes that received a packet successfully, retransmissions can often be avoided. In the majority of cases, multi-link forwarding is thus more efficient and able to save energy. In the last part of this thesis, we present a topology and energy control algorithm (TECA) to turn off the nodes' radio transceivers completely in order to avoid idle listening. By means of TECA, a connected backbone of active nodes is established, while all other nodes may sleep and save energy by turning off their radios. All algorithms presented in this thesis have been fully analyzed, simulated, and implemented on the ESB platform. They are suitable for several applications scenarios and can easily be adapted even to other wireless sensor platforms

    Huginn: A 3D Visualizer for Wireless ns-2 Traces

    Get PDF
    Discrete-event network simulation is a major tool for the research and development of mobile ad-hoc networks (MANETs). These simulations are used for debugging, teaching, understanding, and performance-evaluating MANET protocols. For the first three tasks, visualization of the processes occurring in the simulated network is crucial for verification and credibility of the generated results. Working with the popular network simulator ns-2, we have not yet found a visualization toolkit capable of reading native ns-2 trace files and providing means to change the evaluated parameters without changing the visualization software. Thus, we developed Huginn, a software providing an intuitive way to visualize simulation properties and to determine how they should be displayed without the need of programming. In addition, Huginn has a 3D interface allowing a high exploitation of the (human) user’s perceptive system. It helps to handle the significant cognitive load associated with the mental reconstruction of simulated network processes. Besides presenting the software interface and architecture, we describe algorithmic solutions that might be of a more general interest for similar problems

    Alkali metal dithiocarbamato carboxylates (DTCCs) – synthesis, properties, and crystal structures

    Get PDF
    A series of alkali metal salts of dithiocarbamate‐substituted carboxylate (DTCC) anions were prepared by reaction of the parent amino acids with carbon disulfide and an alkali metal hydroxide. The target compounds, which were isolated in anhydrous form or as hydrates, were extensively characterized by elemental analyses, IR and NMR spectroscopy, thermal analyses, cyclic voltammetry, and single‐crystal X‐ray diffraction. The isolated compounds are more or less hygroscopic and display a varying dehydratization and decomposition behavior upon heating. The assumed degradation of the DTCC scaffold was found to depend on the substitution pattern as well as on the alkali metal counterion, and covers a range between 200 and 340 °C. In aqueous solution, the DTCC anions show irreversible electrochemical oxidations, where the corresponding redox potentials are governed by the substitution pattern of the nitrogen atom. Single‐crystal structural analyses of sodium and potassium derivatives revealed that these compounds exist as two‐ or three‐dimensional coordination polymers in the solid state, with the alkali‐metal ions adopting typical irregular coordination environments with coordination numbers of six or higher

    IceCube Search for Neutrinos Coincident with Compact Binary Mergers from LIGO-Virgo's First Gravitational-Wave Transient Catalog

    Full text link
    Using the IceCube Neutrino Observatory, we search for high-energy neutrino emission coincident with compact binary mergers observed by the LIGO and Virgo gravitational wave (GW) detectors during their first and second observing runs. We present results from two searches targeting emission coincident with the sky localization of each gravitational wave event within a 1000 second time window centered around the reported merger time. One search uses a model-independent unbinned maximum likelihood analysis, which uses neutrino data from IceCube to search for point-like neutrino sources consistent with the sky localization of GW events. The other uses the Low-Latency Algorithm for Multi-messenger Astrophysics, which incorporates astrophysical priors through a Bayesian framework and includes LIGO-Virgo detector characteristics to determine the association between the GW source and the neutrinos. No significant neutrino coincidence is seen by either search during the first two observing runs of the LIGO-Virgo detectors. We set upper limits on the time-integrated neutrino emission within the 1000 second window for each of the 11 GW events. These limits range from 0.02-0.7 GeV cm−2\mathrm{GeV~cm^{-2}}. We also set limits on the total isotropic equivalent energy, EisoE_{\mathrm{iso}}, emitted in high-energy neutrinos by each GW event. These limits range from 1.7 ×\times 1051^{51} - 1.8 ×\times 1055^{55} erg. We conclude with an outlook for LIGO-Virgo observing run O3, during which both analyses are running in real time

    Characteristics of the diffuse astrophysical electron and tau neutrino flux with six years of IceCube high energy cascade data

    Get PDF
    We report on the first measurement of the astrophysical neutrino flux using particle showers (cascades) in IceCube data from 2010 -- 2015. Assuming standard oscillations, the astrophysical neutrinos in this dedicated cascade sample are dominated (∌90%\sim 90 \%) by electron and tau flavors. The flux, observed in the sensitive energy range from 16 TeV16\,\mathrm{TeV} to 2.6 PeV2.6\,\mathrm{PeV}, is consistent with a single power-law model as expected from Fermi-type acceleration of high energy particles at astrophysical sources. We find the flux spectral index to be Îł=2.53±0.07\gamma=2.53\pm0.07 and a flux normalization for each neutrino flavor of ϕastro=1.66−0.27+0.25\phi_{astro} = 1.66^{+0.25}_{-0.27} at E0=100 TeVE_{0} = 100\, \mathrm{TeV}, in agreement with IceCube's complementary muon neutrino results and with all-neutrino flavor fit results. In the measured energy range we reject spectral indices γ≀2.28\gamma\leq2.28 at ≄3σ\ge3\sigma significance level. Due to high neutrino energy resolution and low atmospheric neutrino backgrounds, this analysis provides the most detailed characterization of the neutrino flux at energies below ∌100 TeV\sim100\,{\rm{TeV}} compared to previous IceCube results. Results from fits assuming more complex neutrino flux models suggest a flux softening at high energies and a flux hardening at low energies (p-value ≄0.06\ge 0.06). The sizable and smooth flux measured below ∌100 TeV\sim 100\,{\rm{TeV}} remains a puzzle. In order to not violate the isotropic diffuse gamma-ray background as measured by the Fermi-LAT, it suggests the existence of astrophysical neutrino sources characterized by dense environments which are opaque to gamma-rays.Comment: 4 figures, 4 tables, includes supplementary materia

    Multimessenger Gamma-Ray and Neutrino Coincidence Alerts using HAWC and IceCube sub-threshold Data

    Full text link
    The High Altitude Water Cherenkov (HAWC) and IceCube observatories, through the Astrophysical Multimessenger Observatory Network (AMON) framework, have developed a multimessenger joint search for extragalactic astrophysical sources. This analysis looks for sources that emit both cosmic neutrinos and gamma rays that are produced in photo-hadronic or hadronic interactions. The AMON system is running continuously, receiving sub-threshold data (i.e. data that is not suited on its own to do astrophysical searches) from HAWC and IceCube, and combining them in real-time. We present here the analysis algorithm, as well as results from archival data collected between June 2015 and August 2018, with a total live-time of 3.0 years. During this period we found two coincident events that have a false alarm rate (FAR) of <1<1 coincidence per year, consistent with the background expectations. The real-time implementation of the analysis in the AMON system began on November 20th, 2019, and issues alerts to the community through the Gamma-ray Coordinates Network with a FAR threshold of <4<4 coincidences per year.Comment: 14 pages, 5 figures, 3 table
    • 

    corecore